Fast geometric approximation techniques and geometric embedding problems
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Geometric Problems
This chapter surveys approximation algorithms for hard geometric problems. The problems we consider typically take inputs that are point sets or polytopes in twoor three-dimensional space, and seek optimal constructions, (which may be trees, paths, or polytopes). We limit attention to problems for which no polynomial-time exact algorithms are known, and concentrate on bounds for worst-case appr...
متن کاملApproximation Algorithms for Geometric Optimization Problems
This thesis deals with a number of geometric optimization problems which are all NP-hard. The first problem we consider is the set cover problem for polytopes in R3. Here, we are given a set of points in R3 and a fixed set of translates of an arbitrary polytope. We would like to select a subset of the given polytopes such that each input point is covered by at least one polytope and the number ...
متن کاملApproximation Algorithms for Geometric Median Problems
In this paper we present approximation algorithms for median problems in metric spaces and xed-dimensional Euclidean space. Our algorithms use a new method for transforming an optimal solution of the linear program relaxation of the s-median problem into a provably good integral solution. This transformation technique is fundamentally di erent from the methods of randomized and deterministic ro...
متن کاملEfficient Approximation Schemes for Geometric Problems?
An EPTAS (efficient PTAS) is an approximation scheme where ǫ does not appear in the exponent of n, i.e., the running time is f(ǫ) ·n. We use parameterized complexity to investigate the possibility of improving the known approximation schemes for certain geometric problems to EPTAS. Answering an open question of Alber and Fiala [2], we show that Maximum Independent Set is W[1]-complete for the i...
متن کاملApproximation Schemes for Geometric Coverage Problems
In their seminal work, Mustafa and Ray [25] showed that a wide class of geometric set cover (SC) problems admit a PTAS via local search, which appears to be the most powerful approach known for such problems. Their result applies if a naturally defined “exchange graph” for two feasible solutions is planar and is based on subdividing this graph via a planar separator theorem due to Frederickson ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90252-b